Anytime Dynamic A*: The Proofs
نویسندگان
چکیده
This paper presents a thorough theoretical analysis of a recently developed anytime incremental planning algorithm called Anytime Dynamic A* (AD*). The analysis includes proofs for the correctness of the algorithm and as well as the proofs for several properties of the algorithm related to its efficiency.
منابع مشابه
Formally Verifying Dynamic Properties of Knowledge Based Systems
In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-based systems. We present a case-study of a simple classification method for which we formulate and verify two dynamic properties which are concerned with the anytime behaviour and the computation trace of the classification meth...
متن کاملA New Anytime Dynamic Navigation Algorithm
Dynamic navigation algorithm has been an important component in planning. Navigation algorithm is required to find out an optimal solution to its goal. However, under some environments where time is more critical than optimality, a sub-optimal solution is acceptable. Therefore for practical applications it is useful to find a high sub-optimal solution in limited time. The dynamic algorithm Anyt...
متن کاملDynamic Proofs of Retrievability for Coded Cloud Storage Systems
Cloud storage allows users to store their data in a remote server to get rid of expensive local storage and management costs and then access data of interest anytime anywhere. A number of solutions have been proposed to tackle the verification of remote data integrity and retrievability in cloud storage systems. Most of existing schemes, however, do not support efficient data dynamics and/or su...
متن کاملA Proof Theory for Tractable Approximations of Propositional Reasoning
This paper proposes an uniform framework for the proof theory of tractable approximations of propositional reasoning. The key idea is the introduction of approximate proofs. This makes possible the development of an approximating sequent calculus for propositional deduction where proofs can be sound, complete or multi-directional approximations of classical logic. We show how this calculus subs...
متن کاملMULTI FRACTURE/DELAMINATION ANALYSIS OF COMPOSITES SUBJECTED TO IMPACT LOADINGS
A combined finite/ discrete element method is presented for modelling of composite specimens subjected to dynamic/impact loadings. The main task is set on developing an algorithm for simulation of potential bonding and debonding/delamination phenomena during impact or general dynamic loading conditions. In addition, full fracture analysis can also be performed. The proposed approach adopts a ge...
متن کامل